Task-Agnostic Out-of-Distribution Detection Using Kernel Density Estimation
نویسندگان
چکیده
In the recent years, researchers proposed a number of successful methods to perform out-of-distribution (OOD) detection in deep neural networks (DNNs). So far scope highly accurate has been limited image level classification tasks. However, attempts for generally applicable beyond did not attain similar performance. this paper, we address limitation by proposing simple yet effective task-agnostic OOD method. We estimate probability density functions (pdfs) intermediate features pre-trained DNN performing kernel estimation (KDE) on training dataset. As direct application KDE feature maps is hindered their high dimensionality, use set lower-dimensional marginalized models instead single high-dimensional one. At test time, evaluate pdfs sample and produce confidence score that indicates OOD. The eliminates need making simplifying assumptions about underlying makes method task-agnostic. experiments task using computer vision benchmark datasets. Additionally, medical segmentation brain MRI results demonstrate consistently achieves performance both tasks improves state-of-the-art almost all cases. Our code available at https://github.com/eerdil/task_agnostic_ood. Longer version paper supplementary materials can be found as preprint [8].
منابع مشابه
Edge Detection based on Kernel Density Estimation
Edges of an image are considered a crucial type of information. These can be extracted by applying edge detectors with different methodology. Edge detection is a vital step in computer vision tasks, because it is an essential issue for pattern recognition and visual interpretation. In this paper, we propose a new method for edge detection in images, based on the estimation by kernel of the prob...
متن کاملUnsupervised Discretization Using Kernel Density Estimation
Discretization, defined as a set of cuts over domains of attributes, represents an important preprocessing task for numeric data analysis. Some Machine Learning algorithms require a discrete feature space but in real-world applications continuous attributes must be handled. To deal with this problem many supervised discretization methods have been proposed but little has been done to synthesize...
متن کاملInformation Theoretic Clustering using Kernel Density Estimation
In recent years, information-theoretic clustering algorithms have been proposed which assign data points to clusters so as to maximize the mutual information between cluster labels and data [1, 2]. Using mutual information for clustering has several attractive properties: it is flexible enough to fit complex patterns in the data, and allows for a principled approach to clustering without assumi...
متن کاملKernel Density Estimation
Preface The following diploma thesis is thought to be a diploma thesis in applied statistics. I declare this in the first paragraph of my work, because you can treat this subject either from a theoretic or an applied view, although the borders between these two areas of statistics cannot be drawn exactly. The reason why I got the idea to treat this subject, is that on the one hand density estim...
متن کاملFiltered Kernel Density Estimation
A modification of the kernel estimator for density estimation is proposed which allows the incorporation of local information about the smoothness of the density. The estimator uses a small set of bandwidths rather than a single global one as in the standard kernel estimator. It uses a set of filtering functions which determine the extent of influence of the individual bandwidths. Various versi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-87735-4_9